left view of tree.cpp

// C++ program to print left view of Binary Tree
#include<bits/stdc++.h>
usingnamespacestd;

structNode
{
int data;
structNode *left, *right;
};


structNode *newNode(int item)
{
structNode *temp = (structNode *)malloc(
sizeof(structNode));
 temp->data = item;
 temp->left = temp->right = NULL;
return temp;
}

// left view of a binary tree.
voidleftViewUtil(structNode *root,
int level, int *max_level)
{

if (root == NULL) return;


if (*max_level < level)
 {
 cout << root->data << "";
 *max_level = level;
 }

leftViewUtil(root->left, level + 1, max_level);
leftViewUtil(root->right, level + 1, max_level);

}


voidleftView(structNode *root)
{
int max_level = 0;
leftViewUtil(root, 1, &max_level);
}

intmain()
{
 Node* root = newNode(10);
 root->left = newNode(2);
 root->right = newNode(3);
 root->left->left = newNode(7);
 root->left->right = newNode(8);
 root->right->right = newNode(15);
 root->right->left = newNode(12);
 root->right->right->left = newNode(14);

leftView(root);

return0;
}